Log to log-log crossover of entanglement in a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math> -dimensional massive scalar field

نویسندگان

چکیده

We study three different measures of quantum correlations---entanglement spectrum, entanglement entropy, and logarithmic negativity---for a ($1+1$)-dimensional massive scalar field in flat space-time. The spectrum for the discretized ground state indicates crossover zero-mode regime, which is further substantiated by an analytical treatment both entropy negativity. exact nature this depends on boundary conditions used---the leading order term switches from log to log-log behavior periodic Neumann conditions. In contrast, Dirichlet, it parameters within that are switched. show manifests as change divergent negativity close limit. thus two regimes have fundamentally information content. Furthermore, analysis ground-state fidelity shows us region between critical point $\mathrm{\ensuremath{\Lambda}}=0$ dominated effects, featuring explicit dependence IR cutoff system. For reduced single oscillator, we occurs $Na{m}_{f}\ensuremath{\sim}\ensuremath{\mathcal{O}}(1)$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

Log Abelian Varieties over a Log Point

We study (weak) log abelian varieties with constant degeneration in the log flat topology. If the base is a log point, we further study the endomorphism algebras of log abelian varieties. In particular, we prove the dual short exact sequence for isogenies, Poincaré complete reducibility theorem for log abelian varieties, and the semisimplicity of the endomorphism algebras of log abelian varieti...

متن کامل

The log-log LMS algorithm

This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive lter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient. This eliminates the need for multipliers or shifters in the algorithm's update section. The q...

متن کامل

Ruspace(log N) Dspace(log 2 N= Log Log N) 1

We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP

The aim of this paper is to present a proof of the equivalence of the equalities N P = PCP(log log n; 1) and P = N P. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in N P there exists a restricted veriier using log n + c, c is a constant, random bits. Furthermore, we prove that the equali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2021

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physrevd.103.125008